Sequential decoding with an efficient incremental redundancy ARQ scheme

In this paper, sequential decoding is analyzed in conjunction with an efficient incremental redundancy ARQ scheme using punctured convolutional coding. With the incremental redundancy ARQ scheme, whenever the decoding time for a given data packet exceeds some predetermined value T max, decoding of that data packet is stopped and incremental redundancy bits are provided by the transmitter, a few bits at a time, as needed. It is shown that the incremental redundancy ARQ scheme provides a throughput improvement over the partial retransmission code combining ARQ scheme. The advantage of the incremental redundancy ARQ scheme is that the throughput increases as the starting coding rate increases, over all range of signal to noise ratios.